A Power Optimal Scheduling Algorithm on a Point to Point Wireless Link
نویسندگان
چکیده
In this paper we consider the problem of transmitting packets over a point to point wireless link where the objective is to minimize the average transmitted power subject to a constraint on the average packet delay and drop rate. We propose an online algorithm based on a novel post-decision state based framework and two timescale stochastic approximation technique. We argue that the algorithm indeed converges to the optimal policy within reasonable number of iterations.
منابع مشابه
Power Optimal Non-contiguous Spectrum Access in Multi Front End Radio Enabled Point-to-Point Link
Non-contiguous spectrum chunks allow wireless links to flexibly access a wide amount of bandwidth. MultiChannel Multi-Radio (MC-MR) and Non-Contiguous Orthogonal Frequency Division Multiplexing (NC-OFDM) are the two commercially viable strategies to access non-contiguous spectrum chunks. MC-MR accesses multiple non-contiguous chunks by activating multiple front ends which, in turn, increases th...
متن کاملطراحی لایه- متقاطع برای کنترل ازدحام، مسیریابی و زمانبندی در شبکههای بیسیم ad-hocبا در نظرگرفتن توان الکتریکی گرهها
Abstract Ad hoc Wireless Networks, are networks formed by a collection of nodes through radio. In wireless networking environment, formidable challenges are presented. One important challenge is connection maintenance mechanism for power consumption. In this paper, a multi-objective optimal design is considered for ad-hoc networks which address the electrical power of nodes effects on cross-l...
متن کاملThroughput and Value Maximization in Wireless Packet Scheduling under Energy and Time Constraints
Energy-efficient data transmission is an important issue for mobile communication devices. In this paper, we study throughput and value-based packet scheduling over a wireless link under time and energy constraints. A mobile node is required to deliver multiple data streams to multiple receivers. These data streams may have different importance and incur different energy costs. In this research...
متن کاملSingle-Point Visibility Constraint Minimum Link Paths in Simple Polygons
We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...
متن کاملImproving Quality of Service Routing in Mobile Ad Hoc Networks Using OLSR
Mobile ad hoc networks (MANET) are constructed by mobile nodes without access point. Since MANET has certain constraints, including power shortages, an unstable wireless environment and node mobility, more power-efficient and reliable routing protocols are needed. The OLSR protocol is an optimization of the classical link state algorithm. OLSR introduces an interesting concept, the multipoint r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006